Memetic Algorithm With Meta-Lamarckian Learning and Simplex Search for Distributed Flexible Assembly Permutation Flowshop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of identical factories or shops, each one with machines disposed in series. A set of n available jobs have to be distributed among the factories and then ...
متن کاملA General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem
This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attent...
متن کاملBalance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
This paper shows how the performance of evolutionary multiobjective optimization (EMO) algorithms can be improved by hybridization with local search. The main positive effect of the hybridization is the improvement in the convergence speed to the Pareto front. On the other hand, the main negative effect is the increase in the computation time per generation. Thus, the number of generations is d...
متن کاملImproved genetic algorithm for the permutation flowshop scheduling problem
Genetic algorithms (GAs) are search heuristics used to solve global optimization problems in complex search spaces. We wish to show that the e6ciency of GAs in solving a &owshop problem can be improved signi7cantly by tailoring the various GA operators to suit the structure of the problem. The &owshop problem is one of scheduling jobs in an assembly line with the objective of minimizing the com...
متن کاملThe three stage assembly permutation flowshop scheduling problem
The assembly flowshop scheduling problem has been studied recently due to its applicability in real life scheduling problems. It arises when various fabrication operations are performed concurrently in one stage. It was firstly introduced by Lee et al. (1993) in a flowshop environment. Later, Potts et al. (1995) considered the two-stage assembly flowshop problem with m concurrent operations in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2996305